The egalitarian solution for convex games: some characterizations
نویسندگان
چکیده
منابع مشابه
The egalitarian solution for convex games: some characterizations
The egalitarian solution for TU-games as introduced by Dutta and Ray [Dutta, B., Ray, D., 1989. A concept of egalitarianism under participation constraints, Econometrica 57, 615–635] is studied. Five characterizations of the restriction of this solution to the class of convex games are given. They all involve a stability property due to the concept of the equal division core from Selten [Selten...
متن کاملAxiomatizing the Harsanyi solution, the symmetric egalitarian solution and the consistent solution for NTU-games
The validity of the axiomatization of the Harsanyi solution for NTU-games by Hart (1985) is shown to depend on the regularity conditions imposed on games. Following this observation, we propose two related axiomatic characterizations, one of the symmetric egalitarian solution (Kalai and Samet, 1985) and one of the consistent solution (Maschler and Owen, 1992). The three axiomatic results are st...
متن کاملSome characterizations for SOC-monotone and SOC-convex functions
We provide some characterizations for SOC-monotone and SOC-convex functions by using differential analysis. From these characterizations, we particularly obtain that a continuously differentiable function defined in an open interval is SOC-monotone (SOC-convex) of order n ≥ 3 if and only if it is 2-matrix monotone (matrix convex), and furthermore, such a function is also SOC-monotone (SOC-conve...
متن کاملCharacterizations of extremals for some functionals on convex bodies
We investigate equality cases in inequalities for Sylvester-type functionals. Namely, it was proven by Campi, Colesanti and Gronchi that the quantity ∫ x0∈K ... ∫ xn∈K [V (conv{x0, ..., xn})]dx0...dxn , n ≥ d, p ≥ 1 is maximized by triangles among all planar convex bodies K (parallelograms in the symmetric case). We show that these are the only maximizers, a fact proven by Giannopoulos for p = ...
متن کاملCharacterizations of the Solution Sets of Generalized Convex Minimization Problems
In this paper we obtain some simple characterizations of the solution sets of a pseudoconvex program and a variational inequality. Similar characterizations of the solution set of a quasiconvex quadratic program are derived. Applications of these characterizations are given.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Social Sciences
سال: 2000
ISSN: 0165-4896
DOI: 10.1016/s0165-4896(99)00038-4